-
1 теорема Гиббарда-Сатертвейта
Величина решения основной задачи не может превышать величину решения двойственной задачи. Теорема двойственности линейного программирования, которую нам теперь предстоит сформулировать, говорит, что эти величины в действительности равны. Ключом к пониманию этого факта служит то, что двойственные переменные интерпретируются как множители Лагранжа. — The solution value to the primal problem can be no larger than the solution value to the dual problem. The duality theorem of linear programming, now to be stated, says that these values are actually equal. The key for an understanding of this fact is that, as the notation suggests, the dual variables have the interpretation of Lagrange multipliers.
Russian-English Dictionary "Microeconomics" > теорема Гиббарда-Сатертвейта
См. также в других словарях:
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Max-flow min-cut theorem — In optimization theory, the max flow min cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which when removed in a specific way from the network causes the… … Wikipedia
Semidefinite programming — (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space.Semidefinite programming is a relatively new field… … Wikipedia
Fractional coloring — A 4:2 coloring ofthis graph does not exist.] Fractional coloring is a topic in a young branch of graph theory known as fractional graph theory.It differs from the traditional graph coloring in the sense that it assigns sets of colors instead of… … Wikipedia
Dual problem — In constrained optimization, it is often possible to convert the primal problem (i.e. the original form of the optimization problem) to a dual form, which is termed a dual problem. Usually dual problem refers to the Lagrangian dual problem but… … Wikipedia
John von Neumann — Von Neumann redirects here. For other uses, see Von Neumann (disambiguation). The native form of this personal name is Neumann János. This article uses the Western name order. John von Neumann … Wikipedia
Mathematical economics — Economics … Wikipedia
Oriented matroid — theory allows a combinatorial approach to the max flow min cut theorem. A network with the value of flow equal to the capacity of an s t cut An oriented matroid is a mathematical structure that abstracts the properties of directed graphs and of… … Wikipedia
List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
